Non-cooperative computation: Boolean functions with correctness and exclusivity
نویسندگان
چکیده
منابع مشابه
Non-cooperative computation: Boolean functions with correctness and exclusivity
We introduce the concept of non-cooperative computation (NCC), which is the joint computation of a function by self-motivated agents, where each of the agents possesses one of the inputs to the function. In NCC the agents communicate their input (truthfully or not) to a trusted center, which performs a commonly-known computation and distributes the results to the agents. The question is whether...
متن کاملNonlinearity Computation for Sparse Boolean Functions
An algorithm for computing the nonlinearity of a Boolean function from its algebraic normal form (ANF) is proposed. By generalizing the expression of the weight of a Boolean function in terms of its ANF coefficients, a formulation of the distances to linear functions is obtained. The special structure of these distances can be exploited to reduce the task of nonlinearity computation to solving ...
متن کاملFast computation of symmetries in Boolean functions
Symmetry detection in completely specified Boolean functions is important for several applications in logic synthesis, technology mapping, BDD minimization, and testing. This paper presents a new algorithm to detect four basic types of two-variable symmetries. The algorithm detects all pairs of symmetric variables in one pass over the shared BDD of the multi-output function. The worst-case comp...
متن کاملApproximation of non-Boolean functions by Boolean functions and applications in non-standard computing
Abstract We survey the research and we report new results related to the relationships that exist between Boolean and nonBoolean functions defined on Boolean algebras. The results included here are relevant for set-valued logic that is useful in several non-standard types of circuits: interconnectionfree biomolecular devices, devices based on optical wavelength multiplexing, etc. We extend our ...
متن کاملGeneralized Symmetries in Boolean Functions: Fast Computation and Application to Boolean Matching
In recent years, the notion of symmetry has been extended from classical symmetries to also include constant cofactor symmetries, single variable symmetries and Kronecker symmetries. All these symmetries form a generalized symmetry scheme. Existing methods to detect generalized symmetries require computing the cofactors for each pair of variables to check certain relationships between the cofac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2005
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2005.05.009